Analysis of group paging with pre-backoff

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of group paging with pre-backoff

Group paging can simultaneously activate hundreds of user equipments (UEs) using a single paging message. Upon receiving the group paging message, all UEs should immediately transmit their paging response messages through the random access channels (RACHs). Simultaneous channel access from a huge group of UEs may result in severe collisions of the RACHs during a very short period of time. In th...

متن کامل

Buffered Aloha with K-Exponential Backoff -- Part II: Delay Analysis

This paper presents the delay analysis for buffered Aloha networks with K-Exponential Backoff. Mean access delay and mean queueing delay are derived and demonstrated via the examples of Geometric Retransmission (K=1) and Exponential Backoff (K=∞). The comparison shows that higher delay is incurred with Geometric Retransmission when the aggregate input rate is small, and the delay gap is enlarge...

متن کامل

Performance analysis of general backoff protocols

In this paper, we analyze backoff protocols, such as the one used in Ethernet. We examine a general backoff function (GBF) rather than just the binary exponential backoff (BEB) used by Ethernet. Under some mild assumptions we find stability and optimality conditions for a wide class of backoff protocols with GBF. In particular, it is proved that the maximal throughput rate over the class of bac...

متن کامل

Competitive Analysis of Paging: A Survey

This paper is a survey of competitive analysis of paging. We present proofs showing tight bounds for the competitive ratio achievable by any deterministic or randomized online algorithm. We then go on to discuss variations and reenements of the competitive ratio and the insights they give into the paging problem. Finally, we variations to the online paging problem to which competitive analysis ...

متن کامل

A Uniied Analysis of Paging and Caching

Paging (caching) is the problem of managing a two-level memory hierarchy in order to minimize the time required to process a sequence of memory accesses. In order to measure this quantity, we deene the system parameter miss penalty to represent the extra time required to access slow memory. In the context of paging , miss penalty is large, so most previous studies of on-line paging have implici...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: EURASIP Journal on Wireless Communications and Networking

سال: 2015

ISSN: 1687-1499

DOI: 10.1186/s13638-015-0269-6